public class FindMin {
    public int code(int[] nums) {
        int left  = 0, right = nums.length - 1;
        int x = nums[right];
        while(left < right){
            int mid = left + (right - left) / 2;
            if (nums[mid] > x){
                left = mid + 1;
            }else{
                right = mid;
            }
        }

        return nums[left];
    }
}
